Abstract State Machines: A Generic Model of Computation
نویسنده
چکیده
State Machines: A Generic Model of Computation
منابع مشابه
Res Publica: The Universal Model of Computation
We proffer a model of computation that encompasses a broad variety of contemporary generic models, such as cellular automata—including dynamic ones, and abstract state machines— incorporating, as they do, interaction and parallelism. We ponder what it means for such an intertwined system to be effective and note that the suggested framework is ideal for representing continuous-time and asynchro...
متن کاملAxiomatizing Analog Algorithms
We propose a formalization of generic algorithms that includes analog algorithms. This is achieved by reformulating and extending the framework of abstract state machines to include continuous-time models of computation. We prove that every hybrid algorithm satisfying some reasonable postulates may be expressed precisely by a program in a simple and expressive language.
متن کاملOn the parallel computation thesis
We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures. We show that any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. The cells all run the same algorithm and communicate vi...
متن کاملA Computational Model for Generic Graph Functions
z Abstract The generic graph machine, a Turing machine-like computation model for generic graph functions, is introduced. A connguration of this machine consists of a number of machine instances that each are in a state and point to two nodes of a graph. During the execution of a step, the machine instances perform in parallel a local transformation on the graph and are each replaced by a numbe...
متن کاملThe Expressive Power of Abstract-State Machines
Conventional computation models assume symbolic representations of states and actions. Gurevich’s “Abstract-State Machine” model takes a more liberal position: Any mathematical structure may serve as a state. This results in “a computational model that is more powerful and more universal than standard computation models” [5]. We characterize the Abstract-State Machine model as a special class o...
متن کامل